Binary Quasi Equidistant and Reflected Codes in Mixed Numeration Systems
نویسندگان
چکیده
The problem of constructing quasi equidistant and reflected binary Gray code sequences and code in a mixed factorial, Fibonacci and binomial numeration systems is considered in the article. Some combinatorial constructions and machine algorithms synthesis sequences, based on the method of directed enumeration are offered. For selected parameters of sequences all quasi equidistant (for individual cases reflected) codes with Hamming distance equal to 1 are found.
منابع مشابه
Equidistant Binary Fingerprinting Codes Existence and Identification Algorithms
The fingerprinting technique consists in making the copies of a digital object unique by embedding a different set of marks in each copy. However, a coalition of dishonest users can create pirate copies that try to disguise their identities. We show how equidistant, binary codes that can be used as fingerprinting codes.
متن کاملRepresenting real numbers in a generalized numeration system
numeration systems An abstract numeration system (ANS) is given by a triplet S = (L,Σ, <) where L is a regular language over a totally ordered alphabet (Σ, <). By enumerating the words in L with respect to the radix order induced by <, we define a one-to-one correspondence: repS : N → L valS = rep −1 S : L → N. ANS: a generalization Most numeration systems satisfy the relation: m < n (usual ord...
متن کاملDistributed Storage Systems based on Equidistant Subspace Codes
Distributed storage systems based on equidistant constant dimension codes are presented. These equidistant codes are based on the Plücker embedding, which is essential in the repair and the reconstruction algorithms. These systems posses several useful properties such as high failure resilience, minimum bandwidth, low storage, simple algebraic repair and reconstruction algorithms, good locality...
متن کاملAll q-ary equidistant 3-codes
The elements of {0, 1, . . . , q − 1} are called q-ary codewords of length n over a q-element alphabet. A code is a set of codewords. The Hammingdistance d(c1, c2) of two codewords c1 and c2 is the number of positions where they differ. A code C is called equidistant with distance d if the Hammingdistance of any two codewords is exactly d. Another, shorter name is: q-ary equidistant d-code. The...
متن کاملOn binary codes related to mutually quasi-unbiased weighing matrices
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying the conditions that the number of non-zero weights of the code is four and the code contains the first order Reed–Muller code. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes satisfying the conditions are determined. We also give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013